/**
*      author: Y_Yao
*      created: 2024-10-26 11:09:08
**/

#include<bits/stdc++.h>

using namespace std;
#define int LL
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 7;
int a[N],sum[N];
int n;

void solve()
{
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        sum[i] = sum[i-1] + a[i];
    }
    set<int> hash;

    int ret = 0;
    hash.insert(0);
    for(int i = 1;i <= n;i++)
    {
        if(hash.find(sum[i]) != hash.end())
        {
            ret++;
            hash.clear();
            hash.insert(sum[i]);
        }
        else hash.insert(sum[i]);
    }

    cout << ret << endl;

}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}